Head Linear Reduction
نویسندگان
چکیده
This paper defines head linear reduction, a reduction strategy of λ-terms that performs the minimal number of substitutions for reaching a head normal form. The definition relies on an extended notion of redex, and head linear reduction is therefore not a strategy in the exact usual sense. Krivine’s Abstract Machine is proved to be sound by relating it both to head linear reduction and to usual head reduction. The first proof suggests a variant machine, the Pointer Abstract Machine, which is also proved to be sound with respect to head linear reduction.
منابع مشابه
Krivine Machine and Taylor Expansion in a Non-uniform Setting
The Krivine machine is an abstract machine implementing the linear head reduction of λ -calculus. Ehrhard and Regnier gave a resource sensitive version returning the annotated form of a λ -term accounting for the resources used by the linear head reduction. These annotations take the form of terms in the resource λ -calculus. We generalize this resource-driven Krivine machine to the case of the...
متن کاملEmbedding intersection types into multiplicative linear logic
Intersection types characterize properties on lambda-terms such as head, weak and strong normalization. One can establish relations between intuitionistic logic and intersection types with idempotence. Here we consider a type system without idempotence and we underline common traits with intuitionistic multiplicative linear logic. We analyse head normalization to try and get properties such as ...
متن کاملA semantical introduction to differential linear logic
Extending Linear Logic (LL) with differential constructs has been considered by Girard at a very early stage of the design of this system. This option appears at various places in the conclusion of [Gir86], entitled Two years of linear logic: selection from the garbage collector. In Section V.2 The quantitative attempt of that conclusion, the idea of a syntactic Taylor expansion is explicitly m...
متن کاملA model-oriented introduction to differential linear logic
The idea of extending Linear Logic (LL) with differential constructs has been considered by Girard at a very early stage of the design of this system and this option appears at various places in the conclusion of [Gir86], entitled Two years of linear logic: selection from the garbage collector. In Section V.2 The quantitative attempt of that conclusion, the idea of a syntactic Taylor expansion ...
متن کاملLinear $\beta$-reduction
Linear head reduction is a key tool for the analysis of reduction machines for λ -calculus and for game semantics. Its definition requires a notion of redex at a distance named primary redex in the literature. Nevertheless, a clear and complete syntactic analysis of this rule is missing. We present here a general notion of β -reduction at a distance and of linear reduction (i.e., not restricted...
متن کامل